منابع مشابه
Sensitivity analysis, multilinearity and beyond
Sensitivity methods for the analysis of the outputs of discrete Bayesian networks have been extensively studied and implemented in different software packages. These methods usually focus on the study of sensitivity functions and on the impact of a parameter change to the Chan-Darwiche distance. Although not fully recognized, the majority of these results rely heavily on the multilinear structu...
متن کاملCS364A: Algorithmic Game Theory Lecture #9: Beyond Quasi-Linearity∗
Our discussion so far has assumed that each agent has quasi-linear utility, meaning that it acts to maximize its valuation vi(ω) for the chosen outcome ω minus the payment pi that it has to make. Thus, a bidder’s utility is a linear function of the payment made. We have placed no restrictions on payments, other than the minimal conditions that they are nonnegative and no more than the bid bi(ω)...
متن کاملDesign of High Sensitivity and Linearity Microelectromechanical Systems Capacitive Tire Pressure Sensor using Stepped Membrane
This paper is focused on a novel design of stepped diaphragm for MEMS capacitive pressure sensor used in tire pressure monitoring system. The structure of sensor diaphragm plays a key role for determining the sensitivity of the sensor and the non-linearity of the output.First the structures of two capacitive pressure sensors with clamped square flatdiaphragms, with different thicknesses are inv...
متن کاملLinearity Analysis for Automatic Differentiation
Linearity analysis determines which variables depend on which other variables and whether the dependence is linear or nonlinear. One of the many applications of this analysis is determining whether a loop involves only linear loop-carried dependences and therefore the adjoint of the loop may be reversed and fused with the computation of the original function. This paper specifies the data-flow ...
متن کاملFlow Analysis, Linearity, and PTIME
Flow analysis is a ubiquitous and much-studied component of compiler technology—and its variations abound. Amongst the most well known is Shivers’ 0CFA; however, the best known algorithm for 0CFA requires time cubic in the size of the analyzed program and is unlikely to be improved. Consequently, several analyses have been designed to approximate 0CFA by trading precision for faster computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2019
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2019.06.007